Using Hierarchical Simplicial Meshes to Render Atmospheric Effects

نویسندگان

  • F. Betul Atalay
  • David M. Mount
چکیده

A fundamental element of computer graphics is producing realistic visualizations of various natural phenomena. An important problem in this area is that of rendering scenes containing atmospheric effects, which arise from the absorbtion and scattering of light due to small particles such as dust and smoke. Generating photorealistic renderings through ray-tracing is computationally very demanding because of the time needed to perform numerical integration along the length of each ray to determine the opacity and color of the gaseous media. We present a new data structure and algorithm for efficiently rendering atmospheric effects. Our approach is based on adaptively sampling a sparse set of the rays. Each ray is modeled as a point in a 4-dimensional space, and the results of the numerical integrations for these rays are computed accurately and stored in a 4-dimensional spatial index. The results for arbitrary rays are then computed through relatively inexpensive linear interpolations between neighboring sampled rays. In order for the interpolations to be continuous, it is important that the spatial index be based on a cell complex. This precludes the use of well-known structures such as kd-trees and octrees. Our spatial index is a recently discovered pointerless data structure, called a simplex decomposition tree, which is based on a hierarchical simplicial decomposition of space. In addition to presenting the data structure, we discuss a number of issues in the efficient application of this tree for rendering. We present empirical evidence that our approach can produce renderings of high quality significantly faster than simple ray-tracing. Given the centrality of sampling and reconstruction in computer graphics, this data structure is likely to be useful other applications in this field.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions

We describe a pointerless representation of hierarchical regular simplicial meshes, based on a bisection approach proposed by Maubach. We introduce a new labeling scheme, called an LPT code, which uniquely encodes the geometry of each simplex of the hierarchy, and we present rules to compute the neighbors of a given simplex efficiently through the use of these codes. In addition, we show how to...

متن کامل

Bisection-Based Triangulations of Nested Hypercubic Meshes

Hierarchical spatial decompositions play a fundamental role in many disparate areas of scientific and mathematical computing since they enable adaptive sampling of large problem domains. Although the use of quadtrees, octrees, and their higher dimensional analogues is ubiquitous, these structures generate meshes with cracks, which can lead to discontinuities in functions defined on their domain...

متن کامل

Spatial Indexes for Simplicial and Cellular Meshes

We address the problem of performing spatial and topological queries on simplicial and cellular meshes. These arise in several application domains including 3D GIS, scientific visualization and finite element analysis. Firstly, we present a family of spatial indexes for tetrahedral meshes, that we call tetrahedral trees. Then, we present the PRstar octree, that is a combined spatial data struct...

متن کامل

Diamond-based models for scientific visualization

Title of dissertation: DIAMOND-BASED MODELS FOR SCIENTIFIC VISUALIZATION Kenneth Weiss, Doctor of Philosophy, 2011 Dissertation directed by: Professor Leila De Floriani Department of Computer Science Hierarchical spatial decompositions are a basic modeling tool in a variety of application domains including scientific visualization, finite element analysis and shape modeling and analysis. A popu...

متن کامل

The Cost of Compatible Refinement of Simplex Decomposition Trees

A hierarchical simplicial mesh is a recursive decomposition of space into cells that are simplices. Such a mesh is compatible if pairs of neighboring cells meet along a single common face. Compatibility condition is important in many applications where the mesh serves as a discretization of a function. Enforcing compatibility involves refining the simplices of the mesh further, thus generates a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004